Search results for "Multicast transmission"

Efficient Tree Construction for the Multicast Problem

1999

Distributed algorithms for multicast tree construction

2004

Priority-oriented multicast transmission schemes for heterogeneous traffic in WSNs

2016

To ensure quality of service (QoS) for heterogeneous traffic in IEEE 802.15.4 based wireless sensor networks (WSNs) is a challenging task since no traffic prioritization mechanism is defined in such WSNs. In this paper, we propose two priority-oriented multicast transmission schemes to provide QoS for heterogeneous traffic in WSNs. Contrary to the legacy CSMA/CA and FIFO principles, these schemes differentiate self-generated or received traffic and give priority to delay-sensitive traffic with respect to channel access and packet scheduling. Simulations are performed in order to assess the performance of these schemes in terms of end-to-end delay, energy consumption, packet delivery ratio, …

An efficient distributed algorithm for generating and updating multicast trees

2006

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…

Enabling Retransmissions for Achieving Reliable Multicast Communications in WSNs

2016

To ensure end-to-end reliable multicast or broadcast transmissions in IEEE 802.15.4 based wireless sensor networks WSNs) is a challenging task since no retransmission and acknowledgment mechanisms are defined in such WSNs. In this paper, we propose three retransmission enabled multicast transmission schemes in order to achieve reliable packet transmissions in such networks. Different from the legacy CSMA/CA principle, these schemes allow a sending or forwarding node to retransmit a packet if necessary and enable implicit or/and explicit acknowledgment for multicast services. Simulations are performed in order to assess the performance of these schemes in terms of number of retransmissions, …

A Dynamic Distributed Algorithm for Multicast Path Setup

2005

In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…

An Efficient Distributed Algorithm for Generating Multicast Distribution Trees

2005

Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…

Efficient tree construction for the multicast problem

2002

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the "hot spot" sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed.

The Random Neural Network Model for the On-line Multicast Problem

2005

In this paper we propose the adoption of the Random Neural Network Model for the solution of the dynamic version of the Steiner Tree Problem in Networks (SPN). The Random Neural Network (RNN) is adopted as a heuristic capable of improving solutions achieved by previously proposed dynamic algorithms. We adapt the RNN model in order to map the network characteristics during a multicast transmission. The proposed methodology is validated by means of extensive experiments.